Accelerating Innnite Products Deenition 1.1 -the Class A
نویسنده
چکیده
Slowly convergent innnite products Q 1 n=1 b n are considered, where fb n g is a sequence of numbers, or a sequence of linear operators. Using an asymptotic expansion for the 'remainder' of the innnite product a method for convergence acceleration is suggested. The method is in the spirit of the d-transformation for series. It is very simple and eecient for some classes of sequences fb n g. For complicated sequences fb n g it involves the solution of some linear systems, but it is still eeective. x1. Introduction In this work we investigate convergence acceleration of the innnite product P = 1 Y n=1 b n = b 1 b 2 : : : b n : : : ; (1:1) i.e., evaluating P using a small number of its partial products P m = m Y n=1 b n = b 1 b 2 : : : b m : (1:2) If the elements fb n g are numbers ('the scalar case') then a possible strategy is to transform the problem into a series summation problem, evaluating Log(P) = P 1 n=1 Log(b n). In many applications one encounters innnite products of operators, e.g., fb n g can be s s matrices. In this case the Logarithm operation is not applicable. Hence, we try in this work to act directly on the innnite product, using operations which are natural to the general linear operators, i.e., products and inverses. Our strategy is based upon the methodology of the d-transformation for accelerating the convergence of innnite series S = P 1 n=1 a n using its partial sums S N = P N n=1 a n. Hence we start by reviewing some of the deenitions and results in 7]. is the class of all functions p(x) which have a Poincar e-type asymptotic expansion of the form: p(x) x
منابع مشابه
Fundamental Structures in Well-Structured Infinite Transition Systems
We suggest a simple and clean deenition for Well-Structured Transition Systems Fin90,A CJY96], a general class of innnite state systems for which decidability results exist. As a consequence we can (1) generalize the deenition in many ways, (2) nd examples of (general) WSTS's in many elds, and (3) present new decidability results.
متن کاملNon-simple Purely Innnite C -algebras
A C-algebra A is deened to be purely innnite if there are no characters on A, and if for every pair of positive elements a; b in A, such that b lies in the closed two-sided ideal generated by a, there exists a sequence fr n g in A such that r n ar n ! b. This deenition agrees with the usual deenition by J. Cuntz when A is simple. It is shown that the property of being purely innnite is preserve...
متن کاملAvoiding Pitfalls When Learning Recursive Theories
Learning systems that express theories in rst-order logic must ensure that the theories are executable and, in particular, that they do not lead to innnite recursion. This paper presents a heuristic method for preventing innnite re-cursion in the (multi-clause) deenition of a recursive relation. The method has been implemented in the latest version of foil, but could also be used with any learn...
متن کاملA Note on Recursive Functions
In this paper, we propose a new and elegant deenition of the class of recursive functions, analogous to Kleene's deenition but diiering in the primitives taken, thus demonstrating the computational power of the concurrent programming language in-The deenition can be immediately rephrased for any distributive graph in a count-ably extensive category with products, thus allowing a wide, natural g...
متن کاملFavorable Classes of Mappings and Multimappings in Nonlinear Analysis and Optimization
A generalization of the class of lower C k ?functions introduced by R.T. Rockafellar 28] called lower T k ?functions is proposed in the innnite dimensional case. Mappings of class T k are studied for themselves as they seem to deserve some attention. Other classes of functions such as subconvex functions, subsmooth functions, semismooth functions are either introduced or extended to the case of...
متن کامل